Semicontinuity and Quasiconvex Functions

Criteria are derived for quasiconvex functions under lower semicontinuity and upper semicontinuity conditions. The results thus obtained generalize earlier results for convex functions. We also give new conditions under which a given function is r-convex in the sense given by Avriel.     

On Vector Quasi-Equilibrium Problems with Set-Valued Maps

In this paper, we introduce a new class of vector quasi-equilibrium problems with set-valued maps. Almost all the vector equilibrium models of the Blum-Oettli type in the literature are special cases of our new class of equilibrium problems under consideration. Moreover, a number of C-diagonal quasiconvexity properties are proposed for set-valued maps, which are natural generalizations of the -diagonal quasiconvexity for real functions. Together with an application of continuous selection and fixed-point theorems, these conditions enable us to prove unified existence results of solutions for such vector equilibrium problems.     

拓扑空间中锥拟凸映射多目标优化问题有效解集的连通性

本文研究拓扑空间中锥拟凸多目标优化问题的有效解集的连通性．在目标映射是上连续和拟凸(次严格拟凸)的条件下，证明了锥弱有效(有效)解集是连通的.进一步，在是连续和强拟凸的条件下，证明了锥有效解集是路连通的.     

Nonsmooth Calculus, Minimality, and Monotonicity of Convexificators

Noncompact convexificators, which provide upper convex and lower concave approximations for a continuous function, are defined. Various calculus rules, including extremality and mean-value properties, are presented. Regularity conditions are given for convexificators to be minimal. A characterization of quasiconvexity of a continuous function is obtained in terms of the quasimonotonicity of convexificators.     

弱广义向量拟似变分不等式解的存在性

研究拓扑向量空间上弱广义向量拟似变分不等式解的存在性问题.与Khaliq和Rashid等在单调或伪单调假设条件下,利用KKM定理证明解的存在性不同,在集值映射是非空凸值映射并且有开下截口的条件下,利用Fan-Browder不动点原理证明解的存在性.     

Optimality conditions in multiobjective differentiable programming

A theorem stated in Ref. 1 is corrected.     

Subdifferential Properties of Quasiconvex and Pseudoconvex Functions: Unified Approach

In this paper, we are mainly concerned with the characterization of quasiconvex or pseudoconvex nondifferentiable functions and the relationship between those two concepts. In particular, we characterize the quasiconvexity and pseudoconvexity of a function by mixed properties combining properties of the function and properties of its subdifferential. We also prove that a lower semicontinuous and radially continuous function is pseudoconvex if it is quasiconvex and satisfies the following optimality condition: 0f(x)f has a global minimum at x. The results are proved using the abstract subdifferential introduced in Ref. 1, a concept which allows one to recover almost all the subdifferentials used in nonsmooth analysis.     

Theorems on Lower Semicontinuity and Relaxation for Integrands with Fast Growth

We prove theorems on the lower semicontinuity and integral representations of the lower semicontinuous envelopes of integral functionals with integrands L of fast growth: c ₁ G(|Du|) + c ₂ L c ₃ G(|Du|) + c ₄ with c ₃ c ₁ > 0 and G : [0, [ [0, [ is an increasing convex function such that vG (v)/G(v) as v and is increasing for large v. Repeating the results for the case of the standard growth (G() = ||^p) the quasiconvexity of integrands characterizes the lower semicontinuity of integral functionals and their quasiconvexifications yield the integral functionals that are lower semicontinuous envelopes.Original Russian Text Copyright © 2005 Sychev M. A.The author was supported by the Russian Foundation for Basic Research (Grant 03-01-00162).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 3, pp. 679–697, May–June, 2005.     

Optimality conditions in multiobjective differentiable programming

Necessary conditions not requiring convexity are based on the convergence of a vector at a point and on Motzkin's theorem of the alternative. A constraint qualification is also involved in the establishment of necessary conditions. Three theorems on sufficiency require various levels of convexity on the component of the functions involved, and the equality constraints are not necessarily linear. Scalarization of the objective function is used only in the last sufficiency theorem.The author is thankful to the unknown referce whose comments improved the quality of the paper.     

Sufficient optimality criteria in nonlinear programming for generalized equality-inequality constraints

Sufficient optimality criteria of the Kuhn-Tucker and Fritz John type in nonlinear programming are established in the presence of equality-inequality constraints. The constraint functions are assumed to be quasiconvex, and the objective function is taken to be pseudoconvex (or convex).